Recognition of Composite Elements in Bar Graphs
نویسندگان
چکیده
The issue of graph recognition has been not always investigated until today though the subjects on the document image understanding are very interest and have proposed many methods/systems. This is partly because the graph reading is not yet sufficiently recognized in the practical applications, and partly because the graph recognition is more difficult than the ordinary document analysis/recognition. In this paper, we address an analysis problem of graph structures: especially, we concentrate on the recognition method of composite elements on bar graphs. The knowledge about layout structures is called the layout knowledge. We propose the representation form of this layout knowledge clearly, and make it explicit that our approach based on this layout knowledge can analyze/recognize the graph structures effectively.
منابع مشابه
The Center and Periphery of Composite Graphs
The center (periphery) of a graph is the set of vertices with minimum (maximum) eccentricity. In this paper, the structure of centers and peripheries of some classes of composite graphs are determined. The relations between eccentricity, radius and diameter of such composite graphs are also investigated. As an application we determine the center and periphery of some chemical graphs such as nan...
متن کاملProduct version of reciprocal degree distance of composite graphs
A {it topological index} of a graph is a real number related to the graph; it does not depend on labeling or pictorial representation of a graph. In this paper, we present the upper bounds for the product version of reciprocal degree distance of the tensor product, join and strong product of two graphs in terms of other graph invariants including the Harary index and Zagreb indices.
متن کاملSzeged Dimension and $PI_v$ Dimension of Composite Graphs
Let $G$ be a simple connected graph. In this paper, Szeged dimension and PI$_v$ dimension of graph $G$ are introduced. It is proved that if $G$ is a graph of Szeged dimension $1$ then line graph of $G$ is 2-connected. The dimensions of five composite graphs: sum, corona, composition, disjunction and symmetric difference with strongly regular components is computed. Also explicit formulas of Sze...
متن کاملطراحی بهینه موجشکن مرکب کیسونی تحت اثر امواج غیرخطی
Breakwaters are the important and the costly ones of the marine structures. Composite breakwater is one of the common types in the world. Because of the progress in marine industry in Iran in recent years, designers have noticed this structure. Because of the sensitivity of composite breakwater to environmental conditions, also construction costs, difficulty of repair and maintenance and import...
متن کاملOn the Complexity of Recognizing S-composite and S-prime Graphs
S-prime graphs are graphs that cannot be represented as nontrivial subgraphs of nontrivial Cartesian products of graphs, i.e., whenever it is a subgraph of a nontrivial Cartesian product graph it is a subgraph of one the factors. A graph is S-composite if it is not S-prime. Although linear time recognition algorithms for determining whether a graph is prime or not with respect to the Cartesian ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996